Arithmetical Functions of a Greatest Common Divisor, III. Cesàro's Divisor Problem
نویسندگان
چکیده
منابع مشابه
Arithmetical Functions of a Greatest Common Divisor. I
where g(n) is a bounded arithmetical function and a a real number. In this paper we investigate the average order of magnitude of functions of the form fa((m, «)) where (m, n) denotes the greatest common divisor of m and « and a = 1. The principal result is embodied in the theorem of §3. The method of the paper is elementary. It is based upon an identity (Lemma 3.1) which enables us to reduce t...
متن کاملGreatest common divisor
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest commonmeasure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.[1][2] This notion can be extended to polynomials, see ...
متن کاملThe Fourier Transform of Functions of the Greatest Common Divisor
We study discrete Fourier transformations of functions of the greatest common divisor: n ∑ k=1 f((k, n)) · exp( − 2πikm/n). Euler’s totient function: φ(n) = n ∑ k=1 (k, n) · exp(−2πik/n) is an example. The greatest common divisor (k, n) = n ∑ m=1 exp(2πikm/n) · ∑ d|n cd(m) d is another result involving Ramanujan’s sum cd(m). The last equation, interestingly, can be evaluated for k in the comple...
متن کاملEuclid’s Algorithm for the Greatest Common Divisor
People have been using numbers, and operations on them like division, for a very long time for practical purposes like dividing up the money left by parents for children, or distributing ears of corn equally to groups of people, and more generally to conduct all sorts of business dealings. It may be a bit of a surprise that things like calculating divisors of numbers also form the core of today...
متن کاملThe complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal set of multipliers with respect to either the L0 metric or the L∞ norm. We present and analyze a new method for expressing the gcd of n numbers as their linear combination and give an upper bound on the size of the lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Glasgow Mathematical Association
سال: 1961
ISSN: 2040-6185,2051-2104
DOI: 10.1017/s2040618500034328